材料切割优化问题的特殊解法

doi:10.3969/j.issn.1006-2475.2010.03.049

计算机与现代化 ›› 2010, Vol. 1 ›› Issue (3): 173-3.doi: 10.3969/j.issn.1006-2475.2010.03.049

材料切割优化问题的特殊解法

施佳琦¹,魏祖宽²

1.电子科技大学软件学院,四川成都 610054;2.电子科技大学计算机科学与工程学院,四川成都 610054

收稿日期:2009-02-27 修回日期:1900-01-01 出版日期:2010-03-20 发布日期:2010-03-20

Material Cutting Optimization Question Special Solution

SHI Jia-qi¹,WEI Zu-kuan²

1.School of Software, University of Electronic Science and Technology of China, Chengdu 610054, China; 2.School of Computer Science and Technology, University of Electronic Science and Technology of China, Chengdu 610054, China

Received:2009-02-27 Revised:1900-01-01 Online:2010-03-20 Published:2010-03-20

摘要/Abstract

摘要：

材料切割优化问题是平时生活中经常会碰到的一类问题。所谓“材料切割”就是采用切割的办法对具有一定形状和尺寸的型材、板材进行利用。为了节省材料，必须选用合适的切割方案使得用料最少。对于大规模的材料切割问题，本文用解有限列子问题的方法逐步逼近问题的最优解（列生成法）。最后，把一维材料切割模型推广到更一般的情况。

关键词: 材料切割, 大规模线性规划, 列生成法, 推广

Abstract:

The material cutting optimization question is a kind of questing which usually appears in life. Socalled material cutting means to have sections and plates to certain shape and size with using cutting way. In order to save materials, the appropriate cutting plan must be selected to make consumed the least materials. Regarding the largescale material cutting question, this paper
gradually approximates the problem’s optimal solution with the way of solving the limited row subproblems (a row generator method). Finally, this paper promotes the unidimensional material
cutting model to a more common situation.

Key words: material cutting, largescale linear programming, row generator method, promotion

施佳琦;魏祖宽. 材料切割优化问题的特殊解法[J]. 计算机与现代化, 2010, 1(3): 173-3.

SHI Jia-qi;WEI Zu-kuan. Material Cutting Optimization Question Special Solution[J]. Computer and Modernization, 2010, 1(3): 173-3.

材料切割优化问题的特殊解法

Material Cutting Optimization Question Special Solution

可视化

被引次数

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 1

编辑推荐

Metrics

本文评价